Minion: A Fast Scalable Constraint Solver
نویسندگان
چکیده
We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains increase with problem size – Minion delivers scalable constraint solving. Minion is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models. Focussing on matrix models supports a highly-optimised implementation, exploiting the properties of modern processors. This contrasts with current constraint toolkits, which, in order to provide ever more modelling and solving options, have become progressively more complex at the cost of both performance and usability. Minion is a black box from the user point of view, deliberately providing few options. This, combined with its raw speed, makes Minion a substantial step towards Puget’s ‘Model and Run’ constraint solving paradigm.
منابع مشابه
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative models of a given problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, the Essence language allows the specification of a problem abstractly, i.e. without making modell...
متن کاملWatched Literals for Constraint Propagation in Minion
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the propositional satisfiability community, can also be used to provide highly efficient implementations of constraint propagators. We describe in detail three important aspects of watched literals as we apply them to constraints, and we describe how they are implement...
متن کاملTransition Constraints for Parallel Planning
We present a planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs a new constraint model from domain transition graphs (DTG) of a given planning problem. TCPP encodes the constraint model by using table constraints that allow don’t cares or wild cards as cell values. TCPP uses Minion the constraint solver to solve the constraint model and returns the parallel plan....
متن کاملA Constraint Model for the Settlers Planning Domain
The Settlers planning domain has proved a challenging problem for planning technology. We present a preliminary model of Settlers in the Essence’ specification language. We generate a constraint model for the CSP solver Minion using the automated modelling tool Tailor. We show this model to be competitive with state-of-the-art planning technology.
متن کاملGenerating Special-Purpose Stateless Propagators for Arbitrary Constraints
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation that would be performed on every reachable subdomain of scope(c). Our propagators are stateless: they store no state between calls, and so incur no overhead in storing and backtracking state during search. The preproces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006